Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
نویسندگان
چکیده
منابع مشابه
Considering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملApproximation Techniques for Stochastic Combinatorial Optimization Problems
The focus of this thesis is on the design and analysis of algorithms for basic problems in Stochastic Optimization, speciVcally a class of fundamental combinatorial optimization problems where there is some form of uncertainty in the input. Since many interesting optimization problems are computationally intractable (NP-Hard), we resort to designing approximation algorithms which provably outpu...
متن کاملApproximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
We consider the stochastic graph model where the location of each vertex is a random point in a given metric space. We study the problems of computing the expected lengths of the minimum spanning tree, the minimum perfect matching and the minimum cycle cover on such a stochastic graph and obtain an FPRAS (Fully Polynomial Randomized Approximation Scheme) for each of these problems. Our result f...
متن کاملMaximizing expected utility over a knapsack constraint
The expected utility knapsack problem is to pick a set of items whose values are described by random variables so as to maximize the expected utility of the total value of the items picked while satisfying a constraint on the total weight of items picked. We consider the following solution approach for this problem: (i) use the sample average approximation framework to approximate the stochasti...
متن کاملUtility-Maximizing Scheduling for Stochastic Processing Networks
Stochastic Processing Networks (SPNs) model manufacturing, communication, or service systems. In such a network, service activities require parts and resources to produce other parts. Because service activities compete for resources, the scheduling in a SPN requires deciding which of a set of conflicting activities should be performed at any given time. The goal is to achieve throughput optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2018
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2017.0927